翻訳と辞書 Words near each other ・ K-Rock ・ K-Rockathon ・ K-Run's Park Me In First ・ K-rupt ・ K-Salaam ・ K-series ・ K-series (TV series) ・ K-server problem ・ K-set (geometry) ・ K-Six Television ・ K-Ske Hasegawa ・ K-Slick ・ K-Solo ・ K-SOOL ・ K-approximation of k-hitting set ・ K-ary tree ・ K-B-D ・ K-ballet ・ K-band Multi-Object Spectrograph ・ K-Bar Ranch, Texas ・ K-beta ・ K-Bob's Steakhouse ・ K-box ・ K-car ・ K-Casein ・ K-CASH ・ K-cell (mathematics) ・ K-Ci & JoJo ・ K-Ci & JoJo discography ・ K-Ci (singer) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク K-ary tree ： ウィキペディア英語版 K-ary tree In graph theory, a k-ary tree is a rooted tree in which each node has no more than ''k'' children. It is also sometimes known as a k-way tree, an N-ary tree, or an M-ary tree. A binary tree is the special case where ''k=2''. ==Types of k-ary trees== *A full k-ary tree is a k-ary tree where within each level every node has either ''0'' or ''k'' children. *A perfect k-ary tree is a full 〔(【引用サイトリンク】title=Ordered Trees )〕 k-ary tree in which all leaf nodes are at the same depth. *A complete k-ary tree is a k-ary tree which is maximally space efficient. It must be completely filled on every level (meaning that each node on that level has k children) except for the last level. However, if the last level is not complete, then all nodes of the tree must be "as far left as possible". 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「K-ary tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.